Partial Recovery of Erdðs-Rényi Graph Alignment via k-Core Alignment
نویسندگان
چکیده
منابع مشابه
Image alignment via kernelized feature learning
Machine learning is an application of artificial intelligence that is able to automatically learn and improve from experience without being explicitly programmed. The primary assumption for most of the machine learning algorithms is that the training set (source domain) and the test set (target domain) follow from the same probability distribution. However, in most of the real-world application...
متن کاملStatistical Alignment via k-Restricted Steiner Trees
When relating a set of sequences by a phylogeny, we are essentially constructing a Steiner tree connecting the sequences in the space of all finite sequences. Finding an optimal Steiner tree is in most formulations hard, so population genetics and phylogenetics have often used spanning trees as an approximation for computational expediency. In this assessment you will be asked to investigate an...
متن کاملImage Classification via Sparse Representation and Subspace Alignment
Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...
متن کاملMultiple Partial Order Alignment as a Graph Problem
Multiple Sequence Alignment (MSA) is a fundamental tool of bioinformatics. Row-Column MSA (RC-MSA) methods such as CLUSTALW [12] produce tabular alignments that are now familiar. However, these methods have a number of shortcomings, including difficulty of understanding the result, high computational complexity, questionable assumptions, and other artifacts (such as poor handling of prefixand s...
متن کاملThe Alignment-Distribution Graph
Implementing a data-parallel language such as Fortran 90 on a distributed-memory parallel computer requires distributing aggregate data objects (such as arrays) among the memory modules attached to the processors. The mapping of objects to the machine determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. We present a prog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Measurement and Analysis of Computing Systems
سال: 2019
ISSN: 2476-1249
DOI: 10.1145/3366702